path decomposition造句
例句與造句
- In one direction, suppose a path decomposition of " G " is given.
- A " light " edge of a given tree is an edge that was not selected as part of the heavy path decomposition.
- In this way, the path decomposition nodes containing " v " correspond to the representative points in the interval for " v ".
- Their algorithm processes any tree in linear time, using a heavy path decomposition, so that subsequent lowest common ancestor queries may be answered in constant time per query.
- A tree decomposition in which the underlying tree is a path graph is called a path decomposition, and the width parameter derived from these special types of tree decompositions is known as pathwidth.
- It's difficult to find path decomposition in a sentence. 用path decomposition造句挺難的
- Once a path decomposition has been found, a topological ordering of width " w " ( if one exists ) can be found using dynamic programming, again in linear time.
- Subsequent applications of heavy path decomposition have included solving the level ancestor problem, computing the edit distance between trees, graph drawing and greedy embedding, finding a path near all nodes of a given graph, fault diagnosis in fiber-optic communication networks, and decoding grammar-based codes, among others.
- In the other direction, if " G " is a subgraph of an interval graph with clique number " p " + 1, then " G " has a path decomposition of width " p " whose nodes are given by the maximal cliques of the interval graph.
- For instance, the interval graph shown with its interval representation in the figure has a path decomposition with five nodes, corresponding to its five maximal cliques " ABC ", " ACD ", " CDE ", " CDF ", and " FG "; the maximum clique size is three and the width of this path decomposition is two.
- For instance, the interval graph shown with its interval representation in the figure has a path decomposition with five nodes, corresponding to its five maximal cliques " ABC ", " ACD ", " CDE ", " CDF ", and " FG "; the maximum clique size is three and the width of this path decomposition is two.
- One way to find a path-decomposition with this width is ( similarly to the logarithmic-width path-decomposition of forests described above ) to use the planar separator theorem to find a set of O ( " " n " ) vertices the removal of which separates the graph into two subgraphs of at most 2 " n " / 3 vertices each, and concatenate recursively-constructed path decompositions for each of these two subgraphs.